Secure Non-Linear Network Code Over a One-Hop Relay Network
نویسندگان
چکیده
When there exists a malicious attacker in the network, we need to consider possibilities of eavesdropping and contamination simultaneously. Under an acyclic broadcast optimality linear codes was shown when Eve is allowed attack any $r$ edges. The not under different assumption for Eve. As typical example unicast focus on one-hop relay network single transmission scheme by assuming that attacks only one edge each level. Surprisingly, as result, find non-linear code significantly improves performance over codes. That is, non-liner realizes imperfect security this model cannot be realized This kind superiority still holds even with considering effect sequential error injection information leakage.
منابع مشابه
Strongly Secure Linear Network Coding
In a network with capacity h for multicast, information Xh = (X1, X2, · · · , Xh) can be transmitted from a source node to sink nodes without error by a linear network code. Furthermore, secret information S r = (S 1, S 2, · · · , S r) can be transmitted securely against wiretappers by k-secure network coding for k ≤ h−r. In this case, no information of the secret leaks out even if an adversary...
متن کاملAchievable Region in Slotted ALOHA Throughput for One-Relay Two-Hop Wireless Network Coding
This paper presents achievable regions in slotted ALOHA throughput both without and with network coding for one-relay twohop wireless networks between two end node groups. In this paper, there are no restrictions on the total traffic and the number of end nodes per group. It follows that the relay node will be generally involved with asymmetric bidirectional traffic. This paper derives closed-f...
متن کاملThroughput Analysis on 3-Dimensional Underwater Acoustic Network with One-Hop Mobile Relay
Underwater acoustic communication network (UACN) has been considered as an essential infrastructure for ocean exploitation. Performance analysis of UACN is important in underwater acoustic network deployment and management. In this paper, we analyze the network throughput of three-dimensional randomly deployed transmitter-receiver pairs. Due to the long delay of acoustic channels, complicated n...
متن کاملAnonymous Secure E-Voting Over a Network
In this paper, we propose two new anonymous secure electronic voting schemes that protect the privacy of the voters and prevent double voting. These schemes do not require any special voting channel and the communications can occur entirely over existing networks such as the Internet. The proposed schemes are based on ElGamal digital signature algorithm and can be applied to elections in a vari...
متن کاملSecure Communication System over a GSM Network
As standard GSM protection methods are now well-known to be insecure, we have designed a new secure communication system over GSM network which is developed using the Symbian OS platform. It uses standard cryptographic methods such as key generators, key exchange protocols and public and private key cipher algorithms. This system allows communicating text, voice and any kind of data securely ov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE journal on selected areas in information theory
سال: 2021
ISSN: ['2641-8770']
DOI: https://doi.org/10.1109/jsait.2021.3053697